A Combinatorial Optimization Approach to the Stability of Biomacromolecular Structures
نویسنده
چکیده
The application of optimization techniques derived from the study of Euclidean full Steiner Trees to macromolecules like proteins is reported in the present work. We shall use the concept of Euclidean Steiner Ratio Function (SRF) as a good Lyapunov function in order to perform an elementary stability analysis.
منابع مشابه
Modelling the Biomacromolecular Structure with Selected Combinatorial Optimization Techniques
Modern approaches to the search of Relative and Global minima of potential energy function of Biomacromolecular structures include techniques of combinatorial optimization like the study of Steiner Points and Steiner Trees. These methods have been successfully applied to the problem of modelling the configurations of the average atomic positions when they are disposed in the usual sequence of e...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کامل